Signed analogs of bipartite graphs
نویسندگان
چکیده
منابع مشابه
Signed analogs of bipartite graphs
Thomas Zaslavsky Binghamton University Binghamton, New York, U.S.A. 13902-6000 September 1991 Revised July 1996 Abstra t We hara terize the edge-signed graphs in whi h every \signi ant" positive losed walk (or ombination of walks) has even length, under seven di erent riteria for signi an e, and also those edge-signed graphs whose double overing graph is bipartite. If the property of even lengt...
متن کاملSigned analogs of bipartite graphs 1
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for significance, and also those edge-signed graphs whose double covering graph is bipartite. If the property of even length is generalized to positivity in a second edge signing, the characterizations generalize as well. We also char...
متن کاملSigned Degree Sequences in Signed Bipartite Graphs
A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V ) be a signed bipartite graph with U = {u1, u2, · · · , up} and V = {v1, v2, · · · , vq} . Then signed degree of ui is sdeg(ui) = di = d + i − d − i , where 1 ≤ i ≤ p and d+i ( d − i ) is the number of positive(negative) edges incident with ui , and signed degree of vj is sdeg(...
متن کاملSigned degree sets in signed bipartite graphs
A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...
متن کاملA Note on Signed Degree Sets in Signed Bipartite Graphs
A signed bipartite graph G(U, V ) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V ) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V ) is called its signed degree set. In this paper, we prove that every set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00386-x